Advances in Web%2DBased Learning %2D ICWL 2010 %2D 9th International Conference

Query Ranking in Information Integration.

Unsupervised public health event detection for epidemic intelligence.

Bringing order to your photos event%2Ddriven classification of flickr images based on social knowledge.

Efficient Incremental Near Duplicate Detection Based on Locality Sensitive Hashing.

Evaluating Evidences for Keyword Query Disambiguation in Entity Centric Database Search.

Efficient Semantic%2DAware Detection of Near Duplicate Resources.
Abstract. Efficiently detecting near duplicate resources is an important task when integrating information from various sources and applications. Once detected, near duplicate resources can be grouped together, merged, or removed, in order to avoid repetition and redundancy, and to increase the diversity in the information provided to the user. In this paper, we introduce an approach for efficient semantic-aware near duplicate detection, by combining an indexing scheme for similarity search with the RDF representations of the resources. We provide a probabilistic analysis for the correctness of the suggested approach, which allows applications to configure it for satisfying their specific quality requirements. Our experimental evaluation on the RDF descriptions of real-world news articles from various news agencies demonstrates the efficiency and effectiveness of our approach. Key words: near duplicate detection, data integration 1
The impact of bookmarks and annotations on refinding information.

IQP Incremental query construction%2C a probabilistic approach.

Supporting Active Learning in CLIL through Collaborative Search.

Cross%2DCorpus Textual Entailment for Sublanguage Analysis in Epidemic Intelligence.

Optimizing Near Duplicate Detection for P2P Networks.

LDA for on%2Dthe%2Dfly auto tagging.

DivQ diversification for keyword search over structured databases.

Decay%2Dbased Ranking for Social Application Content.

Annotations and Hypertrails with Spreadcrumbs %2D An Easy Way to Annotate

Boilerplate detection using shallow text features.
In addition to the actual content Web pages consist of navigational elements, templates, and advertisements. This boilerplate text typically is not related to the main content, may deteriorate search precision and thus needs to be detected properly. In this paper, we analyze a small set of shallow text features for classifying the individual text elements in a Web page. We compare the approach to complex, stateof-the-art techniques and show that competitive accuracy can be achieved, at almost no cost. Moreover, we derive a simple and plausible stochastic model for describing the boilerplate creation process. With the help of our model, we also quantify the impact of boilerplate removal to retrieval performance and show significant improvements over the baseline. Finally, we extend the principled approach by straight-forward heuristics, achieving a remarkable accuracy.
How useful are your comments%3F analyzing and predicting youtube comments and comment ratings.

PCIR Combining DHTs and peer clusters for efficient full%2Dtext P2P indexing.
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalability challenge for plain DHTs. Due to the large sizes of document term vocabularies, peers joining the network cause huge amounts of key inserts and, consequently, a large number of index maintenance messages. Thus, the key to exploiting DHTs for distributed information retrieval is to reduce index maintenance costs. Various approaches in this direction have been pursued, including the use of hybrid infrastructures, or changing the granularity of the inverted index to peer level. We show that indexing costs can be significantly reduced further by letting peers form groups in a self-organized fashion. Instead of each individual peer submitting index information separately, all peers of a group cooperate to publish the index updates to the DHT in batches. Our evaluation shows that this approach reduces index maintenance cost by an order of magnitude, while still keeping a complete and correct term index for query processing. 1.
Cardinality estimation and dynamic length adaptation for Bloom filters.

Why finding entities in Wikipedia is difficult%2C sometimes.

Leveraging personal metadata for Desktop search The Beagle   system.



On%2Dthe%2DFly Entity%2DAware Query Processing in the Presence of Linkage.
Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges and then answer queries on the merged data. We describe a novel framework for entity linkage with uncertainty. Instead of using the linkage information to merge structures a-priori, possible linkages are stored alongside the data with their belief value. A new probabilistic query answering technique is used to take the probabilistic linkage into consideration. The framework introduces a series of novelties: (i) it performs merges at run time based not only on existing linkages but also on the given query; (ii) it allows results that may contain structures not explicitly represented in the data, but generated as a result of a reasoning on the linkages; and (iii) enables an evaluation of the query conditions that spans across linked structures, offering a functionality not currently supported by any traditional probabilistic databases. We formally define the semantics, describe an efficient implementation and report on the findings of our experimental evaluation. 1.
Editorial.
calls &amp; calendarEDITORIAL
EIC Editorial.

Proceedings of the 18th International Conference on World Wide Web
Regression testing assures the quality of modified service-oriented business applications against unintended changes. However, a typical regression test suite is large in size. Earlier execution of those test cases that may detect failures is attractive. Many existing prioritization techniques order test cases according to their respective coverage of program statements in a previous version of the application. On the other hand, industrial service-oriented business applications are typically written in orchestration languages such as WS-BPEL and integrated with workflow steps and web services via XPath and WSDL. Faults in these artifacts may cause the application to extract wrong data from messages, leading to failures in service compositions. Surprisingly, current regression testing research hardly considers these artifacts. We propose a multilevel coverage model to capture the business process, XPath, and WSDL from the perspective of regression testing. We develop a family of test case prioritization techniques atop the model. Empirical results show that our techniques can achieve significantly higher rates of fault detection than existing techniques.
Automatically Identifying Tag Types.

Social Knowledge%2DDriven Music Hit Prediction.

Exploiting User Generated Content to Improve Search.

SUITS Faceted User Interface for Constructing Structured Queries from Keywords.

Sharing Distributed Resources in LearnWeb2.0.

A Comparison of Paper%2DBased and Online Annotations in the Workplace.

A Vector Space Model for Ranking Entities and Its Application to Expert Search.

Exploiting Flickr Tags and Groups for Finding Landmark Photos.
Abstract. Many people take pictures of different city landmarks and post them to photo-sharing systems like Flickr. They also add tags and place photos in Flickr groups, created around particular themes. Using tags, other people can search for representative landmark images of places of interest. Searching for landmarks using tags results into many non-landmark photos and provides poor landmark summary for a city. In this paper we propose a new method to identify landmark photos using tags and social Flickr groups. In contrast to similar modern systems, our approach is also applicable when GPS-coordinates for photos are not available. Presented user study shows that the proposed method outperforms state-of-the-art systems for landmark finding. 1
Zerber R top%2Dk retrieval from a confidential index.
Privacy-preserving document exchange among collaboration groups in an enterprise as well as across enterprises requires techniques for sharing and search of access-controlled information through largely untrusted servers. In these settings search systems need to provide confidentiality guarantees for shared information while offering IR properties comparable to the ordinary search engines. Top-k is a standard IR technique which enables fast query execution on very large indexes and makes systems highly scalable. However, indexing access-controlled information for top-k retrieval is a challenging task due to the sensitivity of the term statistics used for ranking. In this paper we present Zerber +R – a ranking model which allows for privacy-preserving top-k retrieval from an outsourced inverted index. We propose a relevance score transformation function which makes relevance scores of different terms indistinguishable, such that even if stored on an untrusted server they do not reveal information about the indexed data. Experiments on two real-world data sets show that Zerber +R makes economical usage of bandwidth and offers retrieval properties comparable with an ordinary inverted index. 1.
How to Trace and Revise Identities.


Benchmarking Fulltext Search Performance of RDF Stores.


Cross%2Dtagging for personalized open social networking.
The Social Web is successfully established and poised for continued growth. Web 2.0 applications such as blogs, bookmarking, music, photo and video sharing systems are among the most popular; and all of them incorporate a social aspect, i.e., users can easily share information with other users. But due to the diversity of these applications – serving different aims – the Social Web is ironically divided. Blog users who write about music for example, could possibly benefit from other users registered in other social systems operating within the same domain, such as a social radio station. Although these sites are two different and disconnected systems, offering distinct services to the users, the fact that domains are compatible could benefit users from both systems with interesting and multi-faceted information. In this paper we propose to automatically establish social links between distinct social systems through cross-tagging, i.e., enriching a social system with the tags of other similar social system(s). Since tags are known for increasing the prediction quality of recommender systems (RS), we propose to quantitatively evaluate the extent to which users can benefit from cross-tagging by measuring the impact of different cross-tagging approaches on tag-aware RS for personalized resource recommendations. We conduct experiments in real world data sets and empirically show the effectiveness of our approaches.
How do you feel about %22dancing queen%22%3F deriving mood %26 theme annotations from user tags.

Policy Based Protection and Personalized Generation of Web Content.

An Architecture for Finding Entities on the Web.

Latent dirichlet allocation for tag recommendation.

Pharos an audiovisual search platform.

Incremental End%2Duser Query Construction for the Semantic Desktop.

A Straightforward Approach for Online Annotations SpreadCrumbs %2D Enhancing and Simplifying Online Collaboration.

Improving music genre classification using collaborative tagging data.

Approximate Queries in Peer%2Dto%2DPeer Systems.

COWES Web user clustering based on evolutionary web sessions.

Distributed Management of Concurrent Web Service Transactions.
Abstract — Business processes involve dynamic compositions of interleaved tasks. Therefore ensuring reliable transactional processing of Web services is crucial for the success of Web service-based B2B and B2C applications. But the inherent autonomy and heterogeneity of Web services render the applicability of conventional ACID transaction models for Web services far from being straightforward. Current Web service transaction models relax the isolation property and rely on compensation mechanisms to ensure atomicity of business transactions in the presence of service failures. However, ensuring consistency in the open and dynamic environment of Web services, where interleaving business transactions enter and exit the system independently, remains an open issue. In this paper we address this problem and propose an architecture that supports concurrency control on the Web services level. An extension to the standard framework for Web service transactions is proposed to enable detecting and handling transactional dependencies between concurrent business transactions. We also present an optimistic protocol for concurrency control that can be deployed in a fully distributed fashion within the proposed architecture. We also empirically evaluate the performance of the proposed solutions in terms of throughput and response time.
How valuable is medical social media data%3F Content analysis of the medical web.

From keywords to semantic queries %2D Incremental query construction on the semantic web.

NEAR%2DMiner Mining Evolution Associations of Web Site Directories for Efficient Maintenance of Web Archives.
Web archives preserve the history of autonomous Web sites and are potential gold mines for all kinds of media and business analysts. The most common Web archiving technique uses crawlers to automate the process of collecting Web pages. However, (re)downloading entire collection of pages periodically from a large Web site is unfeasible. In this paper, we take a step towards addressing this problem. We devise a data mining-driven policy for selectively (re)downloading Web pages that are located in hierarchical directory structures which are believed to have changed significantly (e.g., a substantial percentage of pages are inserted to/removed from the directory). Consequently, there is no need to download and maintain pages that have not changed since the last crawl as they can be easily retrieved from the archive. In our approach, we propose an off-line data mining algorithm called near-Miner that analyzes the evolution history of Web directory structures of the original Web site stored in the archive and mines negatively correlated association rules (near) between ancestor-descendant Web directories. These rules indicate the evolution correlations between Web directories. Using the discovered rules, we propose an efficient Web archive maintenance algorithm called warm that optimally skips the subdirectories (during the next crawl) which are negatively correlated with it in undergoing significant changes. Our experimental results with real data show that our approach improves the efficiency of the archive maintenance process significantly while sacrificing slightly in keeping the “freshness ” of the archives. Furthermore, our experiments demonstrate that it is not necessary to discover nears frequently as the mining rules can be utilized effectively for archive maintenance over multiple versions.
Editorial.
calls &amp; calendarEDITORIAL
Editorial.
calls &amp; calendarEDITORIAL
Unsupervised strategies for shilling detection and robust collaborative filtering.

Proceedings of the 1st International Workshop on Collaborative Open Environments for Project%2DCentered Learning
Abstract. Blogs have the a ordance to become an integral part of teaching and learning processes as a vehicle for knowledge management. Open, exible systems integrating blogs provide user-friendly, personalised microlearning environments while ensuring ubiquitous access. This paper concentrates on blog interoperability in an open space for learning and collaboration. As blogging is one of the most popular web-based forms of publishing today, there is a plethora of di erent blogging tools, feed readers, and aggregators, enabling information dissemination, ltering, and retrieval. Several di erent data structure and interaction standards emerged which make integration a real challenge. This paper aims at creating distributed microlearning environments basing on networks of integrated blogs, discusses problems of such an integration along with possible solutions, and proposes an architecture for loosely-coupled blog integration. The core of this infrastructure consists of a service interface for feed management that allows learners as well as facilitators to automatically set up channel structures for feed syndication, while e ectively reducing the management e orts thereof through proper system support. 1
Proceedings of the 1st International Workshop on Collaborative Open Environments for Project%2DCentered Learning
Abstract. Blogs have the a ordance to become an integral part of teaching and learning processes as a vehicle for knowledge management. Open, exible systems integrating blogs provide user-friendly, personalised microlearning environments while ensuring ubiquitous access. This paper concentrates on blog interoperability in an open space for learning and collaboration. As blogging is one of the most popular web-based forms of publishing today, there is a plethora of di erent blogging tools, feed readers, and aggregators, enabling information dissemination, ltering, and retrieval. Several di erent data structure and interaction standards emerged which make integration a real challenge. This paper aims at creating distributed microlearning environments basing on networks of integrated blogs, discusses problems of such an integration along with possible solutions, and proposes an architecture for loosely-coupled blog integration. The core of this infrastructure consists of a service interface for feed management that allows learners as well as facilitators to automatically set up channel structures for feed syndication, while e ectively reducing the management e orts thereof through proper system support. 1
Adaptive Hypermedia and Adaptive Web%2DBased Systems
Ubiquitous user modeling describes ongoing modeling and exploitation of user behaviour with a variety of systems that share their user models. These shared user models can either be used for mutual or for individual adaptation goals. Ubiquitous user modeling differs from generic user modeling by the three additional concepts: ongoing modeling, ongoing sharing and ongoing exploitation. Systems that share their user models will improve the coverage, the level of detail, and the reliability of the integrated user models and thus allow better functions of adaptation. Ubiquitous user modeling implies new challenges of scalability, scrutability and privacy. A key challenge for ubiquitous user modelling is user models integration. Different systems may represent the same information in different ways, using different syntactic and conceptual structures. Therefore means for negotiation and clarification of data among systems are required. This is fundamental not only to access information, but also to reuse information. Recently, suppliers of user profiles have shown an increased awareness of the need for standards for representing and exchanging user model data. At the same time we observe that
Probabilistic Entity Linkage for Heterogeneous Information Spaces.
Abstract. Heterogeneous information spaces are typically created by merging data from a variety of different applications and information sources. These sources often use different identifiers for data that describe the same real-word entity (for example an artist, a conference, an organization). In this paper we propose a new probabilistic Entity Linkage algorithm for identifying and linking data that refer to the same real-world entity. Our approach focuses on managing entity linkage information in heterogeneous information spaces using probabilistic methods. We use a Bayesian network to model evidences which support the possible object matches along with the interdependencies between them. This enables us to flexibly update the network when new information becomes available, and to cope with the different requirements imposed by applications build on top of information spaces.
A densitometric approach to web page segmentation.

Can all tags be used for search%3F

Wildcards for lightweight information integration in virtual desktops.

Exploiting Distribution Skew for Scalable P2P Text Clustering.
Abstract. K-Means clustering is widely used in information retrieval and data mining. Distributed K-Means variants have already been proposed, but none of the past algorithms scales to large numbers of nodes. In this work we describe a new P2P algorithm which significantly reduces the communication costs involved by exploiting distribution skew, naturally found in text and other datasets. The algorithm achieves high clustering quality and requires no synchronization between peers. An extensive evaluation with up to 100.000 peers shows the algorithm’s effectiveness and scalability as well as its ability to cope with churn. 1
So how can I ask for it%3F

Ranking Categories for Web Search.

Zerber r%2Dconfidential indexing for distributed documents.
To carry out work assignments, small groups distributed within a larger enterprise often need to share documents among themselves while shielding those documents from others ’ eyes. In this situation, users need an indexing facility that can quickly locate relevant documents that they are allowed to access, without (1) leaking information about the remaining documents, (2) imposing a large management burden as users, groups, and documents evolve, or (3) requiring users to agree on a central completely trusted authority. To address this problem, we propose the concept of r-confidentiality, which captures the degree of information leakage from an index about the terms contained in inaccessible documents. Then we propose the r-confidential Zerber indexing facility for sensitive documents, which uses secret splitting and term merging to provide tunable limits on information leakage, even under statistical attacks; requires only limited trust in a central indexing authority; and is extremely easy to use and administer. Experiments with real-world data show that Zerber offers excellent performance for index insertions and lookups while requiring only a modest amount of storage space and network bandwidth. 1.
Query rewriting for lightweight information integration.

DECK Detecting Events from Web Click%2DThrough Data.

A Scalable Approach for QoS%2DBased Web Service Selection.

A Model for Ranking Entities and Its Application to Wikipedia.

Activity Based Links as a Ranking Factor in Semantic Desktop Search.

PHAROS %2D Personalizing Users%27 Experience in Audio%2DVisual Online Spaces.
The large volume of user generated content, although sometimes amateurish, represents a valuable source of information for audiovisual service providers. For example, companies and organizations can efficiently get feedback from consumers observing their online interaction with social media providers. Offering accurately personalized services is possible now, since users provide more personal information about themselves openly, which was previously much more difficult to perceive and measure. In PHAROS, we aim at exploiting the new and freely available data to improve users ’ online experience with respect to their interaction with new media. We focus on building technologies, which bridge the gap between the availability of information (both in form of descriptions of content, such as annotations, and user interests and preferences) and the use of it, for augmenting traditional search and retrieval methods or for personalization purposes. In this paper, we describe how this external information can be brought into PHAROS and how it is used to support users, also describing the multiple components supporting this process. 1.
Attack resistant collaborative filtering.
With the increasing popularity of recommender systems in commercial services, the quality of recommendations has increasingly become an important to study, much like the quality of search results from search engines. While some users faithfully express their true opinion, many provide noisy or incorrect ratings which can be detrimental to the quality of the generated recommendations. The presence of noise can violate modeling assumptions and may thus result in unstable estimates or predictions. Even worse, malicious users can deliberately insert attack profiles in an attempt to bias the recommender system to their benefit. This is a particularly important issue, and it is necessary for systems to provide guarantees on the robustness of recommendations to ensure continued user trust. While previous research has attempted to study the robustness of various existing Collaborative Filtering (CF) approaches, the explicit design of robust recommender systems remains a challenging problem. Approaches such as Intelligent Neighborhood Selection, Association Rules and Robust Matrix Factorization are generally known to produce unsatisfactory results. In this paper, we review previous approaches to robust collaborative filtering; we also describe promising recent approaches that exploit a Singular Value Decomposition (SVD) and are both accurate as well as highly stable to shilling. 1
Semantically Enhanced Entity Ranking.

Using subspace analysis for event detection from web click%2Dthrough data.

Detecting image spam using visual features and near duplicate detection.

Personalizing access to learning networks.

Mining User Profiles to Support Structure and Explanation in Open Social Networking
Abstract. The proliferation of media sharing and social networking websites has brought with it vast collections of site-specific user generated content. The result is a Social Networking Divide in which the concepts and structure common across different sites are hidden. The knowledge and structures from one social site are not adequately exploited to provide new information and resources to the same or different users in comparable social sites. For music bloggers, this latent structure, forces bloggers to select sub-optimal blogrolls. However, by integrating the social activities of music bloggers and listeners, we are able to overcome this limitation: improving the quality of the blogroll neighborhoods, in terms of similarity, by 85 percent when using tracks and by 120 percent when integrating tags from another site.
Adaptive ontology re%2Duse finding and re%2Dusing sub%2Dontologies.

Privacy preserving document indexing infrastructure for a distributed environment.
To carry out work assignments, small groups distributed within a larger enterprise or collaborative community often need to share documents among themselves while shielding those documents from others ’ eyes. In this situation, users need an indexing facility that can quickly locate relevant documents that they are allowed to access, without (1) leaking information about the remaining documents, (2) imposing a large management burden as users, groups, and documents evolve, or (3) requiring users to agree on a central completely trusted authority. In order to achieve this aim user access levels and access control have to be reflected in the index structures and/or retrieval algorithms as well as in ranking the search results. My Ph.D. work focuses on building up an indexing infrastructure which supports confidential indexing, sharing and retrieval of unstructured information which is spread over a number of distributed access-controlled collections. In order to allow for effective and efficient indexing and retrieval in these settings, it considers aspects of confidentiality preservation within an outsourced inverted index, a DHT index structure in P2P networks as well as confidential top-k information retrieval. 1.
Introduction to the IEEE Transactions on Learning Technologies.

Introduction of New Editorial Board Members.

EIC Editorial.

EIC Editorial.

EIC Editorial Vision Issue.

An environment for flexible advanced compensations of Web service transactions.

Social Software for Lifelong Competence Development Challenges and Infrastructure.

The Adaptive Web%2C Methods and Strategies of Web Personalization
Ubiquitous user modeling describes ongoing modeling and exploitation of user behaviour with a variety of systems that share their user models. These shared user models can either be used for mutual or for individual adaptation goals. Ubiquitous user modeling differs from generic user modeling by the three additional concepts: ongoing modeling, ongoing sharing and ongoing exploitation. Systems that share their user models will improve the coverage, the level of detail, and the reliability of the integrated user models and thus allow better functions of adaptation. Ubiquitous user modeling implies new challenges of scalability, scrutability and privacy. A key challenge for ubiquitous user modelling is user models integration. Different systems may represent the same information in different ways, using different syntactic and conceptual structures. Therefore means for negotiation and clarification of data among systems are required. This is fundamental not only to access information, but also to reuse information. Recently, suppliers of user profiles have shown an increased awareness of the need for standards for representing and exchanging user model data. At the same time we observe that
Translation of Overlay Models of Student Knowledge for Relative Domains Based on Domain Ontology Mapping.

Improving distributed join efficiency with extended bloom filter operations.
Bloom filter based algorithms have proven successful as
very efficient technique to reduce communication costs of
database joins in a distributed setting. However, the full
potential of bloom filters has not yet been exploited. Especially in the case of multi-joins, where the data is distributed among several sites, additional optimization opportunities arise, which require new bloom filter operations and computations.  In this paper, we present these extensions and point out how they improve the performance of such distributed joins. While the paper focuses on efficient join computation, the described extensions are applicable to a wide range of usages, where bloom filters are facilitated for compressed set representation.
DHTs over Peer Clusters for Distributed Information Retrieval.
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However,
Personalizing PageRank%2DBased Ranking over Distributed Collections.

Role Based Access Control for the Interaction with Search Engines.
Abstract. Search engine-based features are a basic interaction mean for users to find information inside a Web-based Learning Management Systems (LMS); nonetheless, traditional solutions lack in mechanisms for access rights management for data contained in search engines ’ indexes. This paper explores the integration of a Role Based Access Control (RBAC) mechanism for the interaction with a search engine in a Webbased LMS. We first outline a reference conceptual model for the design of Web-based LMSs exploiting RBAC by means of WebML, a visual modeling language for the high-level specification of data-intensive Web applications. Then, we propose a model-driven approach for the definition of a RBAC-driven interaction between users and search engines, extending WebML with new modeling primitives and outlining significative modeling patterns for the specification of the visibility and action access control levels.
Workplace Learning How We Keep Track of Relevant Information.

Building a Desktop Search Test%2DBed.
Abstract. In the last years several top-quality papers utilized temporary Desktop data and/or browsing activity logs for experimental evaluation. Building a common testbed for the Personal Information Management community is thus becoming an indispensable task. In this paper we present a possible dataset design and discuss the means to create it. 1
Enhancing Expert Search Through Query Modeling.
Abstract. An expert finding is a very common task among enterprise search activities, while its usual retrieval performance is far from the quality of the Web search. Query modeling helps to improve traditional document retrieval, so we propose to apply it in a new setting. We adopt a general framework of language modeling for expert finding. We show how expert language models can be used for advanced query modeling. A preliminary experimental evaluation on TREC Enterprise Track 2006 collection shows that our method improves the retrieval precision on the expert finding task. 1 The Expert Finding Task New challenges for the information retrieval research community are posed by the emerging field of Enterprise Search [2]. The diversity of complex information needs within a typical enterprise together with heterogeneity of Intranet data make it difficult to improve the quality of search in general. Instead, researchers concentrate on several important search tasks. One important example of such a task is finding a relevant expert within an organization. This problem implies that user needs to find the most
Nonblocking Scheduling for Web Service Transactions.
For improved flexibility and concurrent usage existing transaction management models for Web services relax the isolation property of Web service-based transactions. Correctness of the concurrent execution then has to be ensured by commit order-preserving transaction schedulers. However, local schedulers of service providers typically do take into account neither time constraints for committing the whole transaction, nor the individual services &#039; constraints when scheduling decisions are made. This often leads to an unnecessary blocking of transactions by (possibly long-running) others. In this paper, we propose a novel nonblocking scheduling mechanism that is used prior to the actual service invocations. Its aim is to reach an agreement between the client and all participating providers on what transaction processing times have to be expected, accepted, and guaranteed. This enables service consumers to find a set of best suited providers fitting their deadlines. Service providers on the other hand can benefit from the proposed mechanism due to the now possible intelligent scheduling of service invocations for best throughput. In fact, our experiments show a significant improvement in terms of overall throughput, service chain completions and resources &#039; utilization. 1.
Integrating Databases

Engineering Compensations in Web Service Environment.
Business to business integration has recently been performed by employing Web service environments. Moreover, such environments are being provided by major players on the technology markets. Those environments are based on open specifications for transaction coordination. When a failure in such an environment occurs, a compensation can be initiated to recover from the failure. However, current environments have only limited capabilities for compensations, and are usually based on backward recovery. In this paper, we introduce an engineering approach and an environment to deal with advanced compensations based on forward recovery principles. We extend the existing Web service transaction coordination architecture and infrastructure in order to support flexible compensation operations. A contract-based approach is being used, which allows the specification of permitted compensations at runtime. We introduce the abstract service and adapter components which allow us to separate the compensation logic from the coordination logic. In this way, we can easily plug in or plug out different compensation strategies based on a specification language defined on top of basic compensation activities and complex compensation types. Experiments with our approach and environment show that such an approach to compensation is feasible and beneficial.
The Benefit of Using Tag%2DBased Profiles.

Access Control for Sharing Semantic Data across Desktops.

Robust collaborative filtering.

Personalized query expansion for the web.

Lexical analysis for modeling web query reformulation.

Query relaxation using malleable schemas.
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and storage that cannot be adequately handled yet. While current object-relational database systems require clear and unified data schemas, IR systems usually ignore the structured information completely. Malleable schemas, as recently introduced, provide a novel way to deal with vagueness, ambiguity and diversity by incorporating imprecise and overlapping definitions of data structures. In this paper, we propose a novel query relaxation scheme that enables users to find best matching information by exploiting malleable schemas to effectively query vaguely structured information. Our scheme utilizes duplicates in differently described data sets to discover the correlations within a malleable schema, and then uses these correlations to appropriately relax the users’ queries. In addition, it ranks results of the relaxed query according to their respective probability of satisfying the original query’s intent. We have implemented the scheme and conducted extensive experiments with real-world data to confirm its performance and practicality.
Semantic Web Technologies for the Adaptive Web.

Utility analysis for topically biased PageRank.
PageRank is known to be an efficient metric for computing general document importance in the Web. While commonly used as a one-size-fits-all measure, the ability to produce topically biased ranks has not yet been fully explored in detail. In particular, it was still unclear to what granularity of “topic ” the computation of biased page ranks makes sense. In this paper we present the results of a thorough quantitative and qualitative analysis of biasing PageRank on Open Directory categories. We show that the MAP quality of Biased PageRank generally increases with the ODP level up to a certain point, thus sustaining the usage of more specialized categories to bias PageRank on, in order to improve topic specific search.
Mirror site maintenance based on evolution associations of web directories.

P%2DTAG large scale automatic generation of personalized annotation tags for the web.
The success of the Semantic Web depends on the availability of Web pages annotated with metadata. Free form metadata or tags, as used in social bookmarking and folksonomies, have become more and more popular and successful. Such tags are relevant keywords associated with or assigned to a piece of information (e.g., a Web page), describing the item and enabling keyword-based classification. In this paper we propose P-TAG, a method which automatically generates personalized tags for Web pages. Upon browsing a Web page, P-TAG produces keywords relevant both to its textual content, but also to the data residing on the surfer’s Desktop, thus expressing a personalized viewpoint. Empirical evaluations with several algorithms pursuing this approach showed very promising results. We are therefore very confident that such a user oriented automatic tagging approach can provide large scale personalized metadata annotations as an important step towards realizing the Semantic
Sub%2DOntology Discovery for Adaptive Re%2Duse.

Rule%2Dbased Policy Specification.
Abstract. This paper presents a preliminary investigation on the privacy issues involved in the use of location-based services. It is argued that even if the user identity is not explicitly released to the service provider, the geo-localized history of user-requests can act as a quasi-identifier and may be used to access sensitive information about specific individuals. The paper formally defines a framework to evaluate the risk in revealing a user identity via location information and presents preliminary ideas about algorithms to prevent this to happen. 1
Authoring adaptive educational hypermedia on the semantic desktop.


Specification
 
Innovative Approaches for Learning and Knowledge Sharing
Abstract. This paper presents a short overview of blended learning, showing arguments for and against these concepts. Potential blended learning scenarios are described that vary depending on the degree of instructor involvement, learner self-organisation and on-line moderation or coaching. The paper ends with an example of successful application of a blended learning concept in industry. Definition of Blended Learning Blended learning can be defined as the combination of multiple approaches to pedagogy or teaching, e.g. self-paced, collaborative, tutor-supported learning or traditional classroom teaching. Blended learning often refers specifically to the provision or use of resources which combine e-learning with other educational resources. Some authors talk about &#034;hybrid learning &#034; [6, 7], &#034;mixed learning &#034; or &#034;multimethod-learning&#034;. However, all of these concepts broadly refer to the integration (the &#034;blending&#034;) of e-learning tools and techniques with traditional methods. Computerbased learning is no longer regarded as an alternative to traditional forms of learning/teaching. It is integrated into a learning arrangement which combines those methods that have been selected for a specific learning purpose or environment. Blended learning is not really a new concept. Teachers have always been using &#039;combined resources&#039;. Basically, blended learning is just a combination of teaching or facilitation methods, learning styles, resource formats, a range of technologies and a range of expertise. Blended learning is actually a sort of a return to traditional learning concepts. Traditional training also relies on phases of self-directed learning. In classical classroom training, the didactical strategy is based on the • presentation of content by a teacher / trainer • interaction between teacher and students and among students • follow up of content presentation and exercises (homework), to be done individually or in groups /pairs. E. Tomadaki and P. Scott (Eds.): Innovative Approaches for Learning and Knowledge Sharing,

Summarizing local context to personalize global web search.

Optimal Caching for First%2DOrder Query Load%2DBalancing in Decentralized Index Structures.

Priority Based Load Balancing in a Self%2Dinterested P2P Network.
Abstract. A fundamental issue in P2P networks is that of distributing workload in a balanced way to optimize performance. Unfortunately, optimal load balance is difficult to realize, although it is easy to compute, because participants of P2P networks are usually self-interested and seek to maximize their individual utility without considering system-wide utility. In this paper, we study the influence of selfish behaviors on the load balance in P2P networks, and propose a priority based load balancing scheme to help a P2P network achieve better performance. The scheme is simple and effective, and can be easily used in a P2P environment. Besides presenting the theoretical foundation of our scheme, we also address its major implementation issues and conduct extensive experiments to verify its effectiveness and practicality. 1
Automatic and Manual Annotation Using Flexible Schemas for Adaptation on the Semantic Desktop.
  Adaptive Hypermedia builds upon the annotation and adaptation of content. As manual annotation has proven to be the main bottleneck, all means for supporting it by reusing automatically generated metadata are helpful. In this paper we discuss two issues. The first is the integration of a generic AH authoring environment MOT into a semantic desktop environment. In this setup, the semantic desktop environment provides a rich source of automatically generated meta-data, whilst MOT provides a convenient way to enhance this meta-data manually, as needed for an adaptive course environment. Secondly, we also consider the issue of source schema heterogeneity, especially during the automatic metadata generation process, as semantic desktop metadata are generated through a lot of different tools and at different times, so that schemas are overlapping and evolving. Explicitly taking into account all versions of these schemas would require a combinatorial explosion of generation rules. This paper investigates a solution to this problem based on malleable schemas, which allow metadata generation rules to flexibly match different versions of schemas, and can thus cope with the heterogeneous and evolving desktop environment.  
Efficient Parallel Computation of PageRank.
PageRank inherently is massively parallelizable and distributable,  as a result of web&#039;s strict host-based link locality. We show that  the Gau-Seidel iterative method can actually be applied in such a parallel  ranking scenario in order to improve convergence. By introducing  a two-dimensional web model and by adapting the PageRank to this  environment, we present e#cient methods to compute the exact rank  vector even for large-scale web graphs in only a few minutes and iteration  steps, with intrinsic support for incremental web crawling, and  without the need for page sorting/reordering or for sharing global rank  information.
Transactions Concurrency Control in Web Service Environment.
Business transactions in web service environments run with relaxed isolation and atomicity property. In such environments, transactions can commit and roll back independently on each other. Transaction management has to reflect this issue and address the problems which result for example from concurrent access to web service resources and data. In this paper we propose an extension to the WS-Transaction Protocol which ensures the consistency of the data when independent business transactions access the data concurrently under the relaxed transaction properties. Our extension is based on transaction dependency graphs maintained at the service provider side. We have implemented such a protocol on top of WS-Transaction. The extension on the web service provider side is simple to achieve as it can be an integral part of the service invocation mechanism. It has also an advantage from an engineering point of view as it does not change the way consumers or clients of web services have to be programmed. Furthermore, it avoids direct communication between transaction coordinators which preserves security by keeping the information about business transactions restricted to the coordinators which are responsible for them. 1.
Beagle   Semantically Enhanced Searching and Ranking on the Desktop.
Existing desktop search applications, trying to keep up with  the rapidly increasing storage capacities of our hard disks, offer an incomplete  solution for information retrieval. In this paper we describe our Beagle++ desktop search prototype, which enhances conventional fulltext  search with semantics and ranking modules. This prototype extracts  and stores activity-based metadata explicitly as RDF annotations. Our  main contributions are extensions we integrate into the Beagle desktop  search infrastructure to exploit this additional contextual information for  searching and ranking the resources on the desktop. Contextual information  plus ranking brings desktop search much closer to the performance  of web search engines. Initially disconnected sets of resources on the  desktop are connected by our contextual metadata, PageRank derived  algorithms allow us to rank these resources appropriately. First experiments  investigating precision and recall quality of our search prototype  show encouraging improvements over standard search.
Semantic Web Policies %2D A Discussion of Requirements and Research Issues.
Policies are pervasive in web applications. They play crucial  roles in enhancing security, privacy and usability of distributed services.
A Plugin Architecture Enabling Federated Search for Digital Libraries.

A Plugin Architecture Enabling Federated Search for Digital Libraries.

Building Blocks for a Smart Space for LearningTM.

A Distributed Tabling Algorithm for Rule Based Policy Systems.
Distributed Peer-to-Peer and Grid infrastructure require distributed access control mechanisms. These mechanisms can be implemented in distributed trust management infrastructures and usually require reasoning on more than one peer, as soon as authority is delegated or requests involve several authorities. Building on previous work of the authors which formalized such a distributed trust management infrastructure based on distributed logic programs, we describe in this paper how reasoning can be implemented as distributed logic evaluation and how loops during this evaluation can be handled with. Our solution is based on a loop tolerant distributed tabling algorithm which includes in the process protection of sensitive policies and generation of proofs without increasing the complexity of the system.
PHAROS %2D Platform For Search of Audiovisual Resources Across Online Spaces.

Analyzing User Behavior to Rank Desktop Items.
  Existing desktop search applications, trying to keep up with the rapidly increasing storage capacities of our hard disks, are an important step towards more efficient personal information management, yet they offer an incomplete solution. While their indexing functionalities in terms of different file types they are able to cope with are impressive, their ranking capabilities are basic, and rely only on textual retrieval measures, comparable to the first generation of web search engines. In this paper we propose to connect semantically related desktop items by exploiting usage analysis information about sequences of accesses to local resources, as well as about each user’s local resource organization structures. We investigate and evaluate in detail the possibilities to translate this information into a desktop linkage structure, and we propose several algorithms that exploit these newly created links in order to efficiently rank desktop items. Finally, we empirically show that the access based links lead to ranking results comparable with TFxIDF ranking, and significantly surpass TFxIDF when used in combination with it, making them a very valuable source of input to desktop search ranking algorithms. 
Extracting Semantics Relationships between Wikipedia Categories.
Abstract. The Wikipedia is the largest online collaborative knowledge sharing system, a free encyclopedia. Built upon traditional wiki architectures, its search capabilities are limited to title and full-text search. We suggest that semantic information can be extracted from Wikipedia by analyzing the links between categories. The results can be used for building a semantic schema for Wikipedia which could improve its search capabilities and provide contributors with meaningful suggestions for editing the Wikipedia pages. We analyze relevant measures for inferring the semantic relationships between page categories of Wikipedia. Experimental results show that Connectivity Ratio positively correlates with the semantic connection strength. 1
DMC %2D Distributed and Mobile Collaboration Workshop Report.

Pushing task relevant web links down to the desktop.

Site level noise removal for search engines.
The currently booming search engine industry has determined many online organizations to attempt to artificially increase their ranking in order to attract more visitors to their web sites. In the same time, the growth of the web has also inherently generated several  navigational hyperlink structures which have a negative impact on the importance measures employed by current search engines. In this paper we propose and evaluate algorithms for identifying all these noisy links over the web graph, may them be spam or simple relationships between real world entities represented by sites, replication  of content, etc. Unlike prior work, we target a different type of noisy link structures, residing at the site level, instead of the page level. We thus investigate and annihilate site level mutual reinforcement  relationships, abnormal support coming from one site towards another, as well as complex link alliances between web sites. Our experiments with the link database of the TodoBR search engine show a very strong increase in the quality of the output rankings after having applied our techniques.
The CIKM 2005 workshop on information retrieval in peer%2Dto%2Dpeer networks.

Advanced Parallel Processing Technologies
There is a growing demand in high reliability beyond what current RAID can  provide and there are various levels of user demand for data reliability. An efficient  data placement scheme called RM2 has been proposed in [11], which makes a disk  array system tolerable against double disk failures. In this paper, we consider how to  choose an optimal striping unit for RM2 particularly when no workload information is  available except read/write ratio. A disk array simulator for RM2 has been developed  for experimental works. It is shown that RM2 has an optimal striping unit of two  and half tracks in the case of disk read operations, and one third of a single track if  any disk write operations are involved.  Key words : data placement, disk array, performance, reliability, striping  1 Introduction  In the past few years, the performance of processors has been growing steadily, doubling approximately every two years [6], and with the advance of parallel processing technology, the processi...
MailRank using ranking for spam detection.
Can we use social networks to combat spam? This paper investigates the feasibility of MailRank, a new email ranking and classification scheme exploiting the social communication network created via email interactions. The underlying email network data is collected from the email contacts of all MailRank users and updated automatically based on their email activities to achieve an easy maintenance. MailRank is used to rate the sender address of arriving emails such that emails from trustworthy senders can be ranked and classified as spam or non-spam. The paper presents two variants: Basic MailRank computes a global reputation score for each email address, whereas in Personalized MailRank the score of each email address is different for each MailRank user. The evaluation shows that MailRank is highly resistant against spammer attacks, which obviously have to be considered right from the beginning in such an application scenario. MailRank also performs well even for rather sparse networks, i.e., where only a small set of peers actually take part in the ranking of email addresses.
DL Meets P2P %2D Distributed Document Retrieval Based on Classification and Content.
Peer-to-peer architectures are a potentially powerful paradigm for retrieving  documents over networks of digital libraries avoiding single points of  failure by massive federation of (independent) information sources. Today sharing  files over P2P infrastructures is already immensely successful, but restricted  to simple metadata matching. But when it comes to the retrieval of complex  documents, capabilities as provided by digital libraries are needed. Digital libraries  have to cope with compound documents. Though some document parts  (like embedded images) can efficiently be retrieved using metadata matching,  the text-based information needs different methods like full text search. However,  for effective querying of texts, also information like inverted document frequencies  are essential. But due to the distributed characteristics of P2P networks  such &#039;collection-wide&#039; information poses severe problems, e.g. that central updates  whenever changes in any document collection occur use up valuable bandwidth.
Ontology%2DBased Policy Specification and Management.
The World Wide Web makes it easy to share information and resources, but offers few ways to limit the manner in which these resources are shared. The specification and automated enforcement of security-related policies offer promise as a way of providing controlled sharing, but few tools are available to assist in policy specification and management, especially in an open system such as the Web, where resource providers and users are often strangers to one another and exact and correct specification of policies will be crucial. In this paper, we propose the use of ontologies to simplify the tasks of policy specification and administration, discuss how to represent policy inheritance and composition based on credential ontologies, formalize these representations and the according constraints in Frame-Logic, and present POLICYTAB, a prototype implementation of our proposed scheme as a Prot´eg´e plug-in to support policy specification.
Activity Based Metadata for Semantic Desktop Search.
Abstract. In this paper we will give an overview of the Semantic Desktop paradigm, beginning with the history of the term, a definition, current work and its relevance to knowledge management of the future. Existing applications and research results are listed and their role as building blocks of the future Semantic Desktop described. Based on the analysis of existing systems we propose two software architecture paradigms, one for the Semantic Desktop at large and another for applications running on a Semantic Desktop. A view on the context aspect of the Semantic Desktop and the Knowledge Management aspect is given. Based on the current events and projects, we give an outlook on the next steps. 1
Progressive Distributed Top k Retrieval in Peer%2Dto%2DPeer Networks.
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the database objects&#039; degree of match for each different query predicate and returning the best matching objects only. In peer-to-peer systems such strategies are even more important, given the potentially large number of peers, which may contribute to the results. Yet current peer-to-peer research has barely started to investigate such approaches. In this paper we will discuss the benefits of best match/top-k queries in the context of distributed peer-to-peer information infrastructures and show how to extend the limited query processing in current peer-to-peer networks by allowing the distributed processing of top-k queries, while maintaining a minimum of data traffic. Relying on a super-peer backbone organized in the HyperCuP topology we will show how to use local indexes for optimizing the necessary query routing and how to process intermediate results in inner network nodes at the earliest possible point in time cutting down the necessary data traffic within the network. Our algorithm is based on dynamically collected query statistics only, no continuous index update processes are necessary, allowing it to scale easily to large numbers of peers, as well as dynamic additions/deletions of peers. We will show our approach to always deliver correct result sets and to be optimal in terms of necessary object accesses and data traffic. Finally, we present simulation results for both static and dynamic network environments.
The Personal Publication Reader.
This application demonstrates how to provide personalized, syndicated views on distributed web data using Semantic Web technologies. The application comprises four steps: The information gathering  step, in which information from distributed, heterogenous sources is extracted and enriched with machine-readable semantics, the operation step for timely and up-to-date extractions, the reasoning step in which rules reason about the created semantic descriptions and additional knowledge-bases like ontologies and user profile information, and the user interface creation step in which the RDF-descriptions resulting from the reasoning step are interpreted and translated into an appropriate, personalized user interface. We have developed this application for solving the following real-world problem: We provide personalized, syndicated views on the publications of a large European research project with more than twenty geographically distributed partners and embed this information with contextual information on the project, its working groups, information about the authors, related publications, etc. keywords: web data extraction, web data syndication, personalized views.
Semantically Rich Recommendations in Social Networks for Sharing
Recommender algorithms have been quite successfully employed in a  variety of scenarios from filtering applications to recommendations of movies and  books at Amazon.com. However, all these algorithms focus on single item recommendations  and do not consider any more complex recommendation structures.
Searching Dynamic Communities with Personal Indexes.
Often the challenge of finding relevant information is reduced to find  the &#039;right&#039; people who will answer our question. In this paper we present innovative  algorithms called INGA (Interest-based Node Grouping Algorithms) which  integrate personal routing indices into semantic query processing to boost performance.
Caching for Improved Retrieval in Peer%2Dto%2DPeer Networks.

Schema%2DBased Peer%2Dto%2DPeer Systems.
Databases have employed a schema-based approach to store and retrieve structured data for decades. For peerto -peer (P2P) networks, similar approaches are just beginning to emerge. While quite a few database techniques can be re-used in this new context, a P2P data management infrastructure poses additional challenges which have to be solved before schema-based P2P networks become as common as schema-based databases. We will describe some of these challenges and discuss approaches  to solve them. Our discussion will be based on the design decisions we have employed in our Edutella infrastructure, a schema-based P2P network based on RDF and RDF schemas, and will also point out additional work addressing the issues discussed.
TRIPLE %2D an RDF Rule Language with Context and Use Cases.
TRIPLE was designed as a practical rule language for data manipulation applications. Over the last couple of years the language has been deployed in various applications and use case studies. In this paper we first introduce the design principles of TRIPLE and then present some of the applications for which this language has been used.
Efficient 1%2DPass Prediction for Volume Compression.

Using ODP metadata to personalize search.
The Open Directory Project is clearly one of the largest collaborative efforts to manually annotate web pages and export this information in RDF format. This effort involves over 65.000 editors and resulted in metadata specifying topic and importance for more than 4 million web pages. Still, given that this number is just about 0.1 percent of the Web pages indexed by Google, is this effort enough to make a difference? We will start by discussing how these metadata can be used to personalize search, and then show that personalized search using ODP and other directory metadata is feasible already today. We will focus on two ways of doing this, first by directly using ODP and similar metadata, and second by biasing on and thus automatically extending these metadata to the whole web.
Negotiating Trust on the Grid.
Grids support dynamically evolving collections of resources and users, usually spanning multiple administrative domains. The dynamic and crossorganizational aspects of Grids introduce challenging management and policy issues for controlling access to Grid resources. In this paper we show how to extend the Grid Security Infrastructure to provide better support for the dynamic and cross-organizational aspects of Grid activities, by adding facilities for dynamic establishment of trust between parties. We present the PeerTrust language for access control policies, which is based on guarded distributed logic programs, and show how to use PeerTrust to model common Grid trust needs.
Security and Trust Issues in Semantic Grids.
Grid computing allows sharing of services and resources accross  institutions. However, current Grid security mechanisms for authentication  and authorization are too rigid and they lack the ability to  determine how &#034;trustworthy&#034; the result obtained from a specific provider  is likely to be. This paper describes the di#erent facets associated to  Trust and identifies the need for Trust Management approaches in the  context of Virtual Organizations lifecycle and resource access control in  the Grid.
Preventing shilling attacks in online recommender systems.
Collaborative filtering techniques have been successfully employed in recommender systems in order to help users deal with information overload by making high quality personalized recommendations. However, such systems have been shown to be vulnerable to attacks in which malicious users with carefully chosen profiles are inserted into the system in order to push the predictions of some targeted items. In this paper we propose several metrics for analyzing rating patterns of malicious users and evaluate their potential for detecting such shilling attacks. Building upon these results, we propose and evaluate an algorithm for protecting recommender systems against shilling attacks. The algorithm can be employed for monitoring user ratings and removing shilling attacker profiles from the process of computing recommendations, thus maintaining the high quality of the recommendations.
Peer%2DSensitive ObjectRank %2D Valuing Contextual Information in Social Networks.
Building on previous work on how to model contextual information  for desktop search and how to implement semantically rich information exchange  in social networks, we define a new algorithm, Peer-Sensitive ObjectRank for  ranking resources on the desktop. The new algorithm takes into account different  trust values for each peer, generalizing previous biasing PageRank algorithms. We investigate
Minimal Activity Plans Artifacts for Self%2DOrganized Learning within Organizations.
In this paper we present an educational approach to foster selforganized  learning within organizations. Based on the notion that learning as  well as work is embedded in collectively organized and artifact mediated activity  systems and that learning entails individual and social transformation we  outline the concept of Minimal Activity Plans and describe potential use cases.
Adding Client%2DSide Adaptation to the Conceptual Design of e%2DLearning Web Applications.
this paper, we integrate WebML, a high-level model and technology for building server-side Web  applications, with UML-Guide, a UML-based system that generates client-side guides for the adaptation  of Web applications. The combination of the two systems is shown at work on an e-Learning  scenario: WebML is the basis of the specification of a generic e-Learning system, collecting a large  number of learning objects, while UML-Guide is used for building company-specific e-Learning curricula
Proceedings of the ISWC%2A04 Workshop on Trust

Proceedings of the SIGIR Workshop on Peer%2Dto%2DPeer Information Retrieval

Adaptive Hypermedia and Adaptive Web%2DBased Systems
Ubiquitous user modeling describes ongoing modeling and exploitation of user behaviour with a variety of systems that share their user models. These shared user models can either be used for mutual or for individual adaptation goals. Ubiquitous user modeling differs from generic user modeling by the three additional concepts: ongoing modeling, ongoing sharing and ongoing exploitation. Systems that share their user models will improve the coverage, the level of detail, and the reliability of the integrated user models and thus allow better functions of adaptation. Ubiquitous user modeling implies new challenges of scalability, scrutability and privacy. A key challenge for ubiquitous user modelling is user models integration. Different systems may represent the same information in different ways, using different syntactic and conceptual structures. Therefore means for negotiation and clarification of data among systems are required. This is fundamental not only to access information, but also to reuse information. Recently, suppliers of user profiles have shown an increased awareness of the need for standards for representing and exchanging user model data. At the same time we observe that
PROS A Personalized Ranking Platform for Web Search.

The Personal Reader Personalizing and Enriching Learning Resources Using Semantic Web Technologies..
Traditional adaptive hypermedia systems have focused on  providing adaptation functionality on a closed corpus, while Web search  interfaces have delivered non-personalized information to users. In this  paper, we show how we integrate closed corpus adaptation and global  context provision in a Personal Reader environment. The local context  consists of individually optimized recommendations to learning materials  within the given corpus; the global context provides individually optimized  recommendations to resources found on the Web, e. g., FAQs, student  exercises, simulations, etc. The adaptive local context of a learning  resource is generated by applying methods from adaptive educational  hypermedia in a semantic web setting. The adaptive global context is  generated by constructing appropriate queries, enrich them based on  available user profile information, and, if necessary, relax them during  the querying process according to available metadata.
Processing and Optimization of Complex Queries in Schema%2DBased P2P%2DNetworks.

Publish%2FSubscribe for RDF%2Dbased P2P Networks.

No Registration Needed How to Use Declarative Policies and Negotiation to Access Sensitive Resources on the Semantic Web.
Gaining access to sensitive resources on the Web usually involves an explicit registration step, where the client has to provide a predetermined set of information to the server. The registration process yields a login/password combination, a cookie, or something similar that can be used to access the sensitive resources. In this paper we show how an explicit registration step can be avoided on the Semantic Web by using appropriate semantic annotations, rule-oriented access control policies, and automated trust negotiation. After presenting the PeerTrust language for policies and trust negotiation, we describe our implementation of implicit registration and authentication that runs under the Java-based MINERVA Prolog engine. The implementation includes a PeerTrust policy applet and evaluator, facilities to import local metadata, policies and credentials, and secure communication channels between all parties.
Model%2DDriven Design of Web Applications with Client%2DSide Adaptation.
In this paper, we integrate WebML, a high-level model and technology  for building server-side Web applications, with UML-Guide, a UML-based  system that generates client-side guides for the adaptation of Web applications.
A Generic Framework for Assessment in Adaptive Educational Hypermedia.

Cayley DHTs %2D A Group%2DTheoretic Framework for Analyzing DHTs Based on Cayley Graphs.
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is commonly recognized that the primary difficulty in designing DHT is not in static DHT topologies, but in the dynamic DHT algorithm which adapts various static DHT topologies to a dynamic network at Internet. As a direct consequence, the DHT community has been paying more attention to the dynamic DHT algorithm design, resulting in a variety of DHT systems lacking of a common view for analysis and interoperation.In this paper we reiterate the importance of static DHT topologies in the DHT system design by analyzing and classifying current DHTs in terms of their static topologies based on a grouptheoretic model: Cayley graphs. We show that most of current DHT proposals use Cayley graphs as static DHT topologies, thus taking advantage of several important Cayley graph properties such as vertex/edge symmetry, decomposability, optimal fault tolerance and hamiltonicity. We observe that several non-Cayley-graph based DHT proposals such as Koorde /D2B/Distance Halving and Pastry/Tapestry also rely on techniques in their dynamic DHT algorithm design trying to imitate desirable Cayley graph properties. Based on Cayley graphs, we propose the class of Cayley DHTs as a unified group-theoretic model for investigating DHTs from a graph theoretic perspective. The significance of Cayley DHTs is in their explicit inspiration to a uniform dynamic DHT algorithm design, which can directly leverage algebraic design methods thus is able to generate sets of highperformance DHTs adopting various Cayley graph based static DHT topologies but still sharing the same dynamic DHT algorithm.
How to Exploit Ontologies for Trust Negotiation.
The World Wide Web makes it easy to share information and resources, but offers few ways to limit the manner in which these resources are shared. The specification and automated enforcement of security-related policies offer promise as a way of providing controlled sharing, but few tools are available to assist in policy specification and management, especially in an open system such as the Web, where resource providers and users are often strangers to one another and exact and correct specification of policies will be crucial. In this paper, we propose the use of ontologies to simplify the tasks of policy specification and administration, and to avoid several information leakage problems in run-time trust management in open systems.
Personalized Reputation Management in P2P Networks.

How to Build Google2Google %2D An %28Incomplete%29 Recipe.

Top%2Dk Query Evaluation for Schema%2DBased Peer%2Dto%2DPeer Networks.
Increasing the number of peers in a peer-to-peer network usually increases  the number of answers to a given query as well. While having more answers  is nice in principle, users are not interested in arbitrarily large and unordered  answer sets, but rather in a small set of &#034;best&#034; answers. Inspired by the  success of ranking algorithms in Web search engine and top-k query evaluation  algorithms in databases, we propose a decentralized top-k query evaluation algorithm  for peer-to-peer networks which makes use of local rankings, rank merging  and optimized routing based on peer ranks, and thus minimizes both answer set  size and network traffic among peers. As our algorithm is based on query statistics,  no continuous update processes are necessary, allowing it to scaly easily to  large numbers of peers.
Interacting the Edutella%2FJXTA Peer%2Dto%2DPeer Network with Web Services.
Edutella/JXTA is a P2P (Peer-to-Peer) Semantic Web application, which is aimed to accommodate heterogeneous resource metadata repositories in a P2P manner and further facilitate the exchange of the resource metadata based on RDF. Whereas the initial use cases of Edutella/JXTA are defined and implemented in the context of a pure P2P setting, where all Edutella participants are JXTA peers interacting with each other via various P2P services, in this paper we investigate the interaction between Edutella/JXTA and Web services with the purpose of exchanging distributed functionalities between the two platforms. In terms of two typical interaction scenarios: (1) exposing existing Edutella/JXTA P2P services as Web services; and (2) integrating Web services enabled content providers into Edutella/JXTA, we propose an approach for achieving the service layer interaction between Edutella/JXTA and Web services through so-called Web services/Edutella proxies.
PeerTrust Automated Trust Negotiation for Peers on the Semantic Web.
Researchers have recently begun to develop and investigate policy languages to describe trust and security requirements on the Semantic Web. Such policies will be one component of a run-time system that can negotiate to establish trust on the Semantic Web. In this paper, we show how to express different kinds of access control policies and control their use at run time using PeerTrust, a new approach to trust establishment. We show how to use distributed logic programs as the basis for PeerTrusts simple yet expressive policy and trust negotiation language, built upon the rule layer of the Semantic Web layer cake. We describe the PeerTrust language based upon distributed logic programs, and compare it to other approaches to implementing policies and trust negotiation. Through examples, we show how PeerTrust can be used to support delegation, policy protection and negotiation strategies in the ELENA distributed eLearning environment. Finally, we discuss related work and identify areas for further research.
Using UML%2Dbased Feature Models and UML Collaboration Diagrams to Information Modelling for Web%2DBased Applications.
Web oriented software technology has provided access to information  serving environments for a broad audience. This situation requires webbased  software applications which satisfy increasing variety of requirements of  the broad audience. Such variability can be found in requirements for information  but also for environment which is serving the information. In this paper, we  discuss a method which utilizes the UML-based feature modelling to support the  need to model the variability. The information and environment configurations  are modelled as common and variable features of application domain and environment  concepts. Separation of feature models into application domain and  environment allows us to select several configurations of environments to deliver  particular information. The UML collaboration diagrams model collaborations  between the application domain and environment concept and feature instances  as an abstraction for presented information fragments in a web application.
Personalization in distributed e%2Dlearning environments.
Personalized support for learners becomes even more important, when e-Learning takes place in open and dynamic learning and information networks. This paper shows how to realize personalized learning support in distributed learning environments based on Semantic Web technologies. Our approach fills the existing gap between current adaptive educational systems with well-established personalization functionality, and open, dynamic learning repository networks. We propose a service-based architecture for establishing personalized e-Learning, where personalization functionality is provided by various web-services. A Personal Learning Assistant  integrates personalization services and other supporting services, and provides the personalized access to learning resources in an e-Learning network.
Finding Related Pages Using the Link Structure of the WWW.

Knowing Where to Search Personalized Search Strategies for Peers in P2P Networks.
Optimizing and focusing search and results ranking in P2P networks becomes more and more important  with the increasing size of these networks. Even though a few approaches have already started to investigate  the computation of PageRank-like values in P2P environments, none so far has investigated how personalization  could be added to it. This paper tackles the problem of distributedly computing Personalized PageRank values  in such a distributed environment and presents an algorithm which uses them to optimize and focus search in the  P2P network. The paper also discusses how these algorithms improve current distributed search in power law  networks and gives some simulation results.

Ontologies and Metadata for eLearning.


Reasoning and Ontologies for Personalized E%2DLearning in the Semantic Web.
The challenge of the semantic web is the provision of distributed information with well defined meaning, understandable for different parties. Particularly, applications should be able to provide individually optimized access to information by taking the individual needs and requirements of the users into account. In this paper we propose a framework for personalized e-Learning in the semantic web and show how the semantic web resource description formats can be utilized for automatic generation of hypertext structures from distributed metadata. Ontologies and metadata for three types of resources (domain, user, and observation) are investigated. We investigate a logic-based approach to educational hypermedia using TRIPLE, a rule and query language for the semantic web. keywords: Educational hypermedia, Semantic web, Ontologies, Adaptive hypermedia, Reasoning on the semantic web.
The Pudding of Trust.

Super%2Dpeer%2Dbased routing strategies for RDF%2Dbased peer%2Dto%2Dpeer networks.
RDF-based P2P networks have a number of advantages compared to simpler P2P networks such as Napster, Gnutella or to approaches based on distributed indices on binary keys such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones, and they provide complex query facilities against these metadata instead of simple keyword-based searches. In this paper we will discuss RDF-based P2P networks like Edutella as a specific example of a new type of P2P networks- schema-based P2P networks- and describe the use of super-peer based topologies for these networks. Super-peer based networks can provide better scalability than broadcast based networks, and provide support for inhomogeneous schema-based networks, with different metadata schemas and ontologies (crucial for the Semantic Web). Based on (dynamic) metadata routing indices, stated in RDF, the superpeer network supports sophisticated routing and distribution strategies, as well as preparing the ground for advanced mediation and clustering functionalities.
A logical characterization of adaptive educational hypermedia.
Currently, adaptive educational hypermedia systems (AEHS) are described with nonuniform methods, depending on the specific view on the system, the application, or other parameters. There is no common language for expressing functionality of AEHS, hence these systems are difficult to compare and analyze.
Information Integration in Schema%2DBased Peer%2DTo%2DPeer Networks.
Peer-to-peer (P2P) networks have become an important infrastructure during the last years. Using P2P networks for distributed information systems allows us to shift the focus from centrally organized to distributed information systems where all peers can provide and have access to information.
Design Issues and Challenges for RDF%2D and Schema%2DBased Peer%2Dto%2DPeer Systems.
Databases have employed a schema-based approach to store and retrieve structured data for decades. For peerto -peer (P2P) networks, similar approaches are just beginning to emerge. While quite a few database techniques can be re-used in this new context, a P2P data management infrastructure poses additional challenges which have to be solved before schema-based P2P networks become as common as schema-based databases. We will describe some of these challenges and discuss approaches  to solve them. Our discussion will be based on the design decisions we have employed in our Edutella infrastructure, a schema-based P2P network based on RDF and RDF schemas, and will also point out additional work addressing the issues discussed.
Distributed Queries and Query Optimization in Schema%2DBased P2P%2DSystems.
Databases have employed a schema-based approach to store and retrieve  structured data for decades. For peer-to-peer (P2P) networks, similar approaches are  just beginning to emerge, also motivated by the fact, that sending (atomic) queries  to the appropriate peers clearly fails for queries which need data from more than  one peer to be executed. While quite a few database techniques can be re-used in  this new context, a P2P data management infrastructure poses additional challenges  which have to be solved before schema-based P2P networks become as common as  schema-based databases. Because of the dynamic nature of P2P networks, we can  neither assume global knowledge about data distribution, nor are static topologies  and static query plans suitable for these networks. Unlike in traditional distributed  database systems, we cannot assume a complete schema instance but rather work  with a distributed schema which directs query processing tasks from one node to  one or more neighboring nodes.
Semantic Overlay Clusters within Super%2DPeer Networks.
When joining information provider peers to a peer-to-peer network,  an arbitrary distribution is sub-optimal. In fact, clustering peers by their characteristics,  enhances search and integration significantly. Currently super-peer networks,  such as the Edutella network, provide no sophisticated means for such  a &#034;semantic clustering&#034; of peers. We introduce the concept of semantic overlay  clusters (SOC) for super-peer networks enabling a controlled distribution of peers  to clusters. In contrast to the recently announced semantic overlay network approach  designed for flat, pure peer-to-peer topologies and for limited meta data  sets, such as simple filenames, we allow a clustering of complex heterogeneous  schemes known from relational databases and use advantages of super-peer networks,  such as efficient search and broadcast of messages. Our approach is based  on predefined policies defined by human experts. Based on such policies a fully  decentralized broadcast- and matching approach distributes the peers automatically  to super-peers. Thus we are able to automatize the integration of information  sources in super-peer networks and reduce flooding of the network with  messages.
A Metadata Model for Capturing Presentations.

Completing LOM %2D How Additional Axioms Increase the Utility of Learning Object Metadata.
Learning Objects Metadata describing educational resources in order to allow better reusability and retrieval. Unfortunately, annotating complete courses thoroughly with LOM metadata can be a tedious task. In this paper we show how additional inference rules can make this task easier, and allows us to derive additional metadata from existing ones. Additionally, using these rules as integrity constraints helps us to define the constraints on LOM fields, thus taking an important step towards a complete axiomatization of LOM metadata (with the goal of transforming the LOM definitions from a simple syntactical description into a complete ontology). In this paper we will use RDF metadata descriptions and an inference language explicitly developed for RDF (TRIPLE) to represent metadata and axioms. We show how these rules can be applied for the extensions of course metadata, the creation of views onto the metadata or metadata consistency checking.
Searching SCORM Metadata in a RDF%2DBased E%2DLearning P2P Network Using XQuery and Query by Example.

Finding Related Hubs and Authorities.
In this paper a new algorithm for finding hubs (and authorities) related to a specific Web page is presented. Various aspects have been investigated in this direction, like extensions of the HITS algorithm or modifications to the Pagerank algorithm. Our focus is mainly oriented on computing hub scores, but the formulas for authority scores are almost always analogous.
Data%2DCentric Networks and Peer%2Dto%2DPeer Databases.

Towards the Adaptive Semantic Web.
In this paper we show how personalization techniques from  the area of adaptive hypermedia can be achieved in the semantic web. Our approach
Using UML and XMI for Generating Adaptive Navigation Sequences in Web%2DBased Systems.
Navigation in information intensive applications to retrieve required information is time consuming task. Without appropriate navigation support the browsing need not lead to required information. One of the navigation support is guiding a user through the information. The guidance has to be adapted according to different requirements and different goals the user can have. A system can adapt the appearence of information and links or links can lead to different alternatives of information based on observed user preferences, goals, level of knowledge. Parametrizing allow us to capture such variability already in the modelling of such applications. Such parametrized models can serve as an input to a generator which will generate appropriate navigation sequence based on the parameters&#039; values. In this paper we discuss a method for generating such adaptive navigation sequences from the UML state diagrams. The method is discussed on a case of adaptive e-course. Latest advances in UML model representation by means of XML based metadata interchange format can be succesfully utilized for adaptive generation of the adaptive navigation sequences and can speed up a prototyping of navigation support in adaptive web-based systems. Adaptive generation means that generator can be parametrized. The parameters&#039; values are set by user intercation with a system. According to the parameters the generator can generate modified navigation support and appearance of information based on the observed user features. The widely accepted standard based means and tools for XML technology are used for implementing a method for transforming UML state diagrams into web site graph and visualisation of that graph.
Super%2Dpeer%2Dbased routing and clustering strategies for RDF%2Dbased peer%2Dto%2Dpeer networks.
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones, and they provide complex query facilities against these metadata instead of simple keyword-based searches.

Elena A Mediation Infrastructure for Educational Services.
The paper presents the work of the Elena project. The contribution of this paper is twofold: The first part of the paper elaborates on the notion of educational services. Educational services are differentiated from learning objects and put in context of web services. A model for educational services is introduced and current limitations of metadata standards are addressed. In the second part of the paper a mediation infrastructure for educational services, so called smart learning space, is sketched. The architecture of smart learning spaces is based on P2P and semantic web technologies.
Integrating Adaptive Hypermedia Techniques and Open RDF%2Dbased Environments.
The World Wide Web has not only revolutionized the area of traditional hypermedia, it is also starting to influence adaptive hypermedia research. The main feature of the World Wide Web has been simplicity, standards based protocols and formats, and open environments and systems. In this paper we will investigate the potential of these aspects for adaptive hypermedia systems, based on a discussion of existing standards useful for adaptive hypermedia and on experiences we have gained through an RDF-based P2P infrastructure we have been developing in the context of several projects.

Design issues and challenges for RDF%2D and schema%2Dbased peer%2Dto%2Dpeer systems.
Databases have employed a schema-based approach to store and retrieve structured data for decades. For peerto -peer (P2P) networks, similar approaches are just beginning to emerge. While quite a few database techniques can be re-used in this new context, a P2P data management infrastructure poses additional challenges which have to be solved before schema-based P2P networks become as common as schema-based databases. We will describe some of these challenges and discuss approaches  to solve them. Our discussion will be based on the design decisions we have employed in our Edutella infrastructure, a schema-based P2P network based on RDF and RDF schemas, and will also point out additional work addressing the issues discussed.
Knowledge Modeling for Open Adaptive Hypermedia.
This paper proposes a knowledge modeling approach for  adaptive, open corpus hypermedia systems. Our approach towards adaptive,  open corpus hypermedia is based on interpreting standard metadata  of learning objects. For each corpus of documents integrated into the  open adaptive hypermedia system (OAHS) we are calculating subgraphs  of the ontology for estimating the user&#039;s knowledge with respect to this  corpus. This enables the OAHS to understand the knowledge contained  in learning materials, to make estimations about an individual user&#039;s  knowledge state and to learn the prerequisite knowledge required for  learning objects from given structures in the materials.
HyperCuP %2D Hypercubes
Semantic Web Services are a promising combination of Semantic Web and Web service technology, aiming at providing means of automatically executing, discovering and composing semantically marked-up Web services. We envision peer-to-peer networks which allow for carrying out searches in real-time on permanently reconfiguring networks to be an ideal infrastructure for deploying a network of Semantic Web Service providers. However, P2P networks evolving in an unorganized manner suffer from serious scalability problems, limiting the number of nodes in the network, creating network overload and pushing search times to unacceptable limits. We address these problems by imposing a deterministic shape on P2P networks: We propose a graph topology which allows for
An O%2DTelos Provider Peer for the RDF%2DBased Edutella P2P%2DNetwork.
The open source project Edutella is a Peer-to-Peer (P2P) network for learning materials. It builds upon meta data standards defined for the WWW and aims to provide a RDF-based meta data infrastructure for P2P applications. In this paper we discuss a prototype provider peer for the Edutella network, which provides advanced reasoning peers for RDF data. This prototype peer provides storage and querying services for which it uses the ConceptBase database with its powerful reasoning mechanism as storage and query facility. ConceptBase implements the meta data language O-Telos while Edutella uses RDF(S). Based on previous work in this area we present a mechanism to translate the property-centered meta modeling language RDF to the object-centered meta modeling language O-Telos. Thus we are able to provide a Datalog: based reasoning facility for the P2P Edutella network.
OAI%2DP2P A Peer%2Dto%2DPeer Network for Open Archives.
OAI is designed with a low-barrier technology approach, thus allowing institutions to provide content metadata with little effort. On the other hand, search capabilities are very limited on OAI data providers, and have to be provided by separate service providers. We propose that data providers form a peer-to-peer network which supports distributed search over all connected metadata repositories. Such an approach is already implemented for learning content metadata (project &#039;Edutella&#039;). We describe how this technology could be reused in the OAI context. This would allow OAI repositories to provide distributed search capabilities and effortless integration of new archives within a peer-topeer network with little additional implementation effort.
Towards Open Standards The Evolution of an XML%2FJSP%2FWebDAV Based Collaborative Courseware Generating System.
In this paper we present the evolution of a collaborative courseware  generating system that is featured by XML-based course structure representation,  JSP-based dynamic courseware presentation, and WebDAV-based collaborative  courseware authoring. While the first system implementation employs  a proprietary design that uses a self-defined XML DTD to represent  course structure, the second and the third system implementation take an open  standard based approach, which are respectively SCORM 1.1 and SCORM 1.2  conformant. In the latter two implementations, all learning resources contained  in an existing Java course are re-designed according to the SCORM 1.1 and  SCORM 1.2 Content Model and further annotated with corresponding SCORM  metadata. In addition, the course structure is re-constructed utilizing SCORM  1.1 Content Structure Format and SCORM 1.2 Content Packaging Specification.
Bridging O%2DTelos and XML with XML Schema the Authoring Environment for KBS Adaptive Hyperbook.

Semantic Web and Peer%2Dto%2DPeer Technologies for Distributed Learning Repositories.
Metadata for the World Wide Web is important, but metadata for Peer-to-Peer (P2P) networks is absolutely crucial. In this paper we discuss the open source project Edutella and related projects, which combine semantic web and peer-topeer technologies in order to make distributed learning repositories possible and useful. We describe the main services of the Edutella network infrastructure and its architecture based on the exchange of RDF metadata, starting with the query service as one of the core services of Edutella. We discuss the Edutella Common Data Model (ECDM) as basis for the Edutella query exchange language (RDFQEL -i) implementing distributed queries over the Edutella network, and discuss as one example an O-Telos-Peer with native Datalog query and inference capabilities. We then sketch a new P2P routing topology which minimizes broadcast traffic and distance between the peers in such a network, as well as a modification language needed for supporting distributed update and annotation. A short section discusses the changing role of adaptation in these distributed repositories (as open corpus hypermedia instead of the closed ones investigated in most research projects so far). Finally, we discuss an application of the Edutella network for digital libraries (OAI-P2P) and the use of Edutella in the ELENA project which aims to create smart spaces for learning.
Towards a Modification Exchange Language for Distributed RDF Repositories.
Many RDF repositories have already been implemented with various  access languages and mechanisms. The aim of the EDUTELLA framework is to  allow communication between different RDF repository implementations. Part  of EDUTELLA is a Query Exchange Language (QEL) which can be used as  lingua franca to retrieve information from RDF repositories. This work shows  why we also need standardization of distributed modification capabilities. We  describe use case scenarios for annotation and replication services and use them  as guideline for our approach towards a Modification Exchange Language  (MEL) for distributed RDF repositories.
Animiertes UML als Medium f%FCr die Didaktik der objektorientierten Programmierung.

A Scalable and Ontology%2DBased P2P Infrastructure for Semantic Web Services.
Semantic Web Services are a promising combination of Semantic Web and Web service technology, aiming at providing means of automatically executing, discovering and composing semantically marked-up Web services. We envision peer-to-peer networks which allow for carrying out searches in real-time on permanently reconfiguring networks to be an ideal infrastructure for deploying a network of Semantic Web Service providers. However, P2P networks evolving in an unorganized manner suffer from serious scalability problems, limiting the number of nodes in the network, creating network overload and pushing search times to unacceptable limits. We address these problems by imposing a deterministic shape on P2P networks: We propose a graph topology which allows for
EDUTELLA Searching and Annotating Resources within an RDF%2Dbased P2P Network.
P2P applications for searching and exchanging information over the Web have become increasingly popular. This has lead to a number of (usually thematically) focused communities, which allow efficient searching within such communities, and which use specific metadata sets to specify the resources stored within the P2P network. By concentrating on domain and application specific formats for metadata and query languages, however, current P2P networks appear to be fragmenting into non-interoperable niche markets. This contribution describes the open source project Edutella which builds upon metadata standards defined for the WWW and aims to provide an RDF-based metadata infrastructure for P2P applications, building on the recently announced JXTA Framework. We describe one basic service (query) and an Edutella application (annotation) within this network, both being built on a common query language exchange format, and specify the main architecture and APIs of the Edutella P2P network.
EDUTELLA a P2P networking infrastructure based on RDF.
Metadata for the World Wide Web is important, but metadata for Peer-to-Peer (P2P) networks is absolutely crucial. In this paper we discuss the open source project Edutella which builds upon metadata standards defined for the WWW and aims to provide an RDFbased metadata infrastructure for P2P applications, building on the recently announced JXTA Framework. We describe the goals and main services this infrastructure will provide and the architecture to connect Edutella Peers based on exchange of RDF metadata. As the query service is one of the core services of Edutella, upon which other services are built, we specify in detail the Edutella Common Data Model (ECDM) as basis for the Edutella query exchange language (RDF-QEL-i) and format implementing distributed queries over the Edutella network. Finally, we shortly discuss registration and mediation services, and introduce the prototype and application scenario for our current Edutella aware peers.
Using Extended Logic Programming for Alarm%2DCorrelation in Cellular Phone Networks.
. Alarm correlation is a necessity in large mobile phone networks,  where the alarm bursts resulting from severe failures would otherwise overload  the network operators. In this paper, we describe how to realize alarm-correlation  in cellular phone networks using extended logic programming which provides  integrity constraints, implicit, and explicit negation. We solve different scenarios  for a GSM network application using the extended logic programming system  Revise.  1 Introduction  Mobile networks, like the pan-European GSM networks, are growing rapidly. Alarm handling systems enable the operators to run such networks with minimal operation costs. The goal is to collect and interpret alarm messages and failure indications from the network elements without human intervention.  In large networks, like the current GSM networks, the alarm vectors supplied by the network elements tend to flood the workstations of the operators especially in critical situations like the passage of a t...
A Collaborative Courseware Generating System Based on WebDAV%2C XML%2C and JSP.
Today, with the use of global cooperation in education, more and more courses are given directly on the Web in a collaborative manner among geographically dispersed universities. Consequently, Web-based courseware generation is becoming increasingly complicated as this cooperation also introduces additional challenges for the courseware authoring and publishing process. In this paper, we present a courseware generating system which focuses on facilitating the courseware generating process taking advantage of recent Internet protocols and industry standards. We adopt a collaboration-friendly Internet protocol, WebDAV, to support collaborative courseware authoring, XML to represent meta-data of course contents, and JSP to realize dynamic courseware presentation. With its simple syntax, XML can on the one hand simplify the courseware authoring process in company with WebDAV, on the other hand, as a neutral meta-language, it can also separate course contents from courseware presentation in company with JSP.
Constructing a web%2Dbased asynchronous and synchronous collaboration environment using WebDAV and Lotus Sametime.

Open Learning Repositories and Metadata Modeling.
. Building repositories for e-learning is an iterative process and course content and course structure are always changing. We realized the necessity to separate content from structure of a given course during the conception of our first e-learning repository, which we called KBS-Hyperbook, several years ago at our institute. This system has been built around a conceptual model for structure and contents of the domain, which is expressed in the O-Telos conceptual modelling language. To ease exchange of metadata between such repositories, the Open Learning Repository (OLR), an e-learning repository we built during the last year to experiment with various features useful for such repositories, has been developed using RDF/RDFS as modelling language.  In the first part of this paper, we describe the OLR system in more detail, and show how it uses RDF/RDFS as its underlying modelling language to express information about the learning objects contained in the repository, as well as information about the relationships between these learning objects. Based on our experience in meta-modelling using different modelling languages, we will in the second part of this paper discuss RDF/RDFS and O-Telos modelling in more depth and will analyse similarities and differences of these two modelling languages.  Keywords  Meta-modelling, RDF/RDFS, conceptual modelling, hypermedia, learning repositories.  1 The Open Learning Repository  1.1 Motivation  Our Open Learning Repositories aim at metadata-based course portals, which structure and connect modularised course materials over the Web. The modular content can be distributed anywhere on the internet, and is integrated by explicit metadata information in order to build courses and connected sets of learning materials. Modules can be reuse...
Extendible Adaptive Hypermedia Courseware Integrating Different Courses and Web Material.

Metadata for Adaptive and Distributed Learning Repositories.

Using Extended Logic Programming for Alarm%2DCorrelation in Cellular Phone Networks.
. Alarm correlation is a necessity in large mobile phone networks,  where the alarm bursts resulting from severe failures would otherwise overload  the network operators. In this paper, we describe how to realize alarm-correlation  in cellular phone networks using extended logic programming which provides  integrity constraints, implicit, and explicit negation. We solve different scenarios  for a GSM network application using the extended logic programming system  Revise.  1 Introduction  Mobile networks, like the pan-European GSM networks, are growing rapidly. Alarm handling systems enable the operators to run such networks with minimal operation costs. The goal is to collect and interpret alarm messages and failure indications from the network elements without human intervention.  In large networks, like the current GSM networks, the alarm vectors supplied by the network elements tend to flood the workstations of the operators especially in critical situations like the passage of a t...
Model%2DBased Diagnosis for Open Systems Fault Management.
this article, we address these problems
Adaptive Hyperbooks for Constructivist Teaching.

Hyperbook Data Modeling.
Educators are currently investing much effort into the conversion of their textbooks  and lectures into hypertext documents. Within our KBS Virtual Classroom project, we have  recently developed a data-base oriented method for systematically designing such hyperbooks.
Das KBS Virtual Classroom Projekt Informatik%2DAusbildung %FCber das Internet.

Strategies in Model%2DBased Diagnosis.
The concept of diagnosis as a process has  been coined to introduce a dynamic representation  of the diagnosis process and subsequent  work has focused on formalizing this  notion. Advancing on previous proposals  built upon rather procedural semantics, we  aim to give a formal and declarative semantics  for the diagnosis process. We give a logical  characterization of preferences and strategies,  expressed by preference relations on single  diagnoses and modal logic formulas on  sets of diagnoses, respectively.

Semantically Guided Theorem Proving for Diagnosis Applications.
In this paper we demonstrate how general purpose automated theorem proving techniques can be used to solve realistic model-based diagnosis problems. For this we modify a model generating tableau calculus such that a model of a correctly behaving device can be used to guide the search for minimal diagnoses. Our experiments show that our general approach is competitive with specialized diagnosis systems. 
A Static Model%2DBased Engine for Model%2DBased Reasoning.
Most systems for model--based reasoning record  justifications during the search for solutions. In the  popular ATMS systems this can lead to an explosion  of recorded information when solving complicated  problems. We propose an engine for model-based reasoning which works directly on logical  models, uses static precompiled information on the  structure of the underlying theory and does no further  recording during search. This engine (DRUM-II) solves large complicated problems with attractive  time and space complexity. To demonstrate the  efficiency of the engine we give a new characterization  of a popular benchmark suite, solve it with  our engine and compare the performance to previous  results.
Model%2DBased Alarm Correlation in Cellular Phone Networks.
Though cellular phone networks already contain intelligent network elements diagnosing local faults, alarm bursts caused by network element failures cannot be handled properly by this technology. It is the responsibility of the operators to extract the relevant alarms from such a burst and identify the cause. To assist the operators, several alarm correlation tools have been developed.
Diagnostic Agents for Distributed Systems.
In this paper we introduce an agent--based framework for the diagnosis of spatially distributed technical systems, based on a suitable distributed diagnosis architecture. We implement the framework using the concepts of vivid agents and extended logic programming. To demonstrate the power of our approach, we solve a diagnosis example from the domain of unreliable datagram protocols.  Submission Information: This paper has not been submitted to another conference or workshop.  Keywords: Multi Agent Systems, Logic Programming, Diagnosis  Post-Proceedings: We also submit this paper for the post--proceedings. 1 Introduction  The advent of large distributed technical systems like computer and telecommunication networks has been one of the most striking developments of our time. Research in model--based diagnosis as documented in several AI conferences and a series of workshops [Pro94, Nej95] has up to now not tackled the question how to support such systems by a suitable diagnosis architect...
WebRC Configuration Management for a Cooperation Tool.
. Recently, several document management systems supporting asynchronous cooperation over the world--wide web have been proposed. Such systems provide access controlled areas for sharing objects related to a specific topic among a group of people working together. Configuration Management Support is however not present or very much restricted in these systems. We argue that such support is necessary and discuss how configuration management concepts should be integrated in cooperation tools. We describe our WebRC system, the first web--based cooperation tool with full configuration management support. 1 Introduction  Recently, several document management systems supporting asynchronous cooperation over the world--wide web have been proposed [RBT95,Kin96,BB96]. Such systems support asynchronous cooperative work by providing areas for sharing objects among a group of users. These areas contain objects like text documents, pictures or spreadsheets as well as folders, which represent sets of...
Tableaux for Diagnosis Applications.
. In [NF96] a very efficient system for solving diagnosis tasks has been described, which is based on belief revision procedures and uses first order logic system descriptions. In this paper we demonstrate how such a system can be rigorously formalized from the viewpoint of deduction by using the calculus of hyper tableaux [BFN96]. The benefits of this approach are twofold: first, it gives us a clear logical description of the diagnosis task to be solved; second, as our experiments show, the approach is feasible in practice and thus serves as an example of a successful application of deduction techniques to real-world applications. 1 Introduction In this paper we will demonstrate that model generation theorem proving is very well suited for solving consistency-based diagnosis tasks. According to Reiter ([Rei87]) a simulation model of the technical device under consideration is constructed and is used to predict its normal behavior. By comparing this prediction with the actual behavior ...
Abstract temporal diagnosis in medical domains.
Most current model-based diagnosis formalisms and algorithms are defined only for static systems, which is often inadequate for medical reasoning. In this paper we describe a model-based framework plus algorithms for diagnosing timedependent systems where we can define qualitative temporal scenarios. Complex temporal behavior is described within a logical framework extended by qualitative temporal constraints. Abstract observations aggregate from observations at time points to assumptions over time intervals. These concepts provide a very natural representation and make diagnosis independent of the number of actual observations and the temporal resolution. The concept of abstract temporal diagnosis captures in a natural way the kind of indefinite temporal knowledge which is frequently available in medical diagnoses. We use viral Hepatitis B (including a set of real Hepatitis B data) to illustrate and evaluate our framework. The comparison of our results with the results of HEPAXPERT-I is promising. The diagnosis computed in our system is often more precise than the diagnosis in HEPAXPERT-I and we detect inconsistent data sequences which cannot be detected in the latter system.
A Model%2Dbased Reasoning Approach to Circumscription.
In this paper we show how model--based reasoning techniques can be used to solve circumscription entailment problems without computing the circumscription axiom. We characterize the circumscription by a small subset of the minimal models computed by a revision function. Using these models a filtering function decides, whether a given formula is entailed by the circumscription. We describe, how these functions can be efficiently implemented. Finally we demonstrate the power of our approach by applying it to current formalisms from the reasoning about action and change domain.

Formalizing Reasoning About Change A Temporal Diagnosis Approach.

A Formal Framework for Representing Diagnosis Strategies in Model%2DBased Diagnosis Systems.
Recent work has pointed out that diagnosis  strategies are a necessary tool for the diagnosis  of complex systems. Nevertheless, though current  diagnosis systems are able to use explicit  system models, their representation of diagnosis  strategies is only implicit. In this paper we  introduce a formal meta--language to express  strategic knowledge in an explicit way. This  language is sufficient to formalize all strategies  introduced in previous work, and extends previous  diagnosis strategies by the integration of  empirical knowledge and by explicit statements  about dependencies between actions. We provide  a declarative semantics for this language  and an architecture for implementation.
Proposing Measurements in Dynamic Systems.

Formalizing the Repair Process %2D Extended Report.
This paper defines the model-based diagnosis and repair process. We consider  repair (i.e. restoration of specified system purposes) as the main goal of this  process. Our goal is to define how an intelligent agent integrates and schedules  observations and actions in an interleaved way in order to guarantee a specified  system purpose. We define a temporal framework where all concepts necessary  to represent repair (actual, possible and plausible worlds, purpose, observations,  actions and failures) can be integrated. Using these concepts we present an algorithm  scheme describing the repair process.
Harnessing the Power of Temporal Abstractions in Model%2DBased Diagnosis of Dynamic Systems.

REVISE An Extended Logic Programming System for Revising Knowledge Bases.
In this paper we describe REVISE, an extended logic programming system for revising knowledge bases. REVISE is based on logic programming with explicit negation, plus a two-valued assumption revision to face contradiction , encompasses the notion of preference levels. Its reliance on logic programming allows efficient computation and declarativity, whilst its use of explicit negation, revision and preference levels enables modeling of a variety of problems including default reasoning, belief revision and modelbased reasoning. It has been implemented as a Prolog--meta interpreter and tested on a spate of examples, namely the representation of diagnosis strategies in modelbased reasoning systems. 
Model%2Dbased Diagnosis with Qualitative Temporal Uncertainty.
In this paper we describe a framework for  model-based diagnosis of dynamic systems,  which extends previous work in this field by  using and expressing temporal uncertainty in  the form of qualitative interval relations a  la Allen. Based on a logical framework extended  by qualitative and quantitative temporal  constraints we show how to describe  behavioral models (both consistency- and  abductive-based), discuss how to use abstract  observations and show how abstract temporal  diagnoses are computed. This yields an  expressive framework, which allows the representation  of complex temporal behavior allowing  us to represent temporal uncertainty.
Formalizing the Repair Process %2D Extended Report.
This paper defines the model-based diagnosis and repair process. We consider  repair (i.e. restoration of specified system purposes) as the main goal of this  process. Our goal is to define how an intelligent agent integrates and schedules  observations and actions in an interleaved way in order to guarantee a specified  system purpose. We define a temporal framework where all concepts necessary  to represent repair (actual, possible and plausible worlds, purpose, observations,  actions and failures) can be integrated. Using these concepts we present an algorithm  scheme describing the repair process.
Diamon A Model%2DBased Troubleshooter Based on Qualitative Reasoning.
The detection and localization of misbehavior in technical systems is  an engineering task of crucial importance. Due to the increasing structural  and behavioral complexity of these systems human operators are  overwhelmed in emergency situations by the huge amounts of data to  evaluate and to interpret. In this context, model-based diagnosis has  proven very valuable and the increasing amount of industrial applications  being currently developed raises important and interesting questions to  be solved.
Integrating Model%2DBased and Heuristic Features in a Real%2DTime Expert System.

Evaluating Recursive Queries in Distributed Databases.
In this paper, we study the execution of logic queries in a distributed  database environment. We assume that each local database system can execute  logic queries, and we design methods for the efficient execution of queries  requiring data from multiple sites. Conventional optimization strategies which  are well-known in the field of distributed databases, such as the early evaluation  of selection conditions and the clustering of processing to manipulate and  exchange large sets of tuples, are redefined in view of the additional difficulties  due to logic queries, in particular to recursive rules.  In order to allow efficient processing of these logic queries we present several  program transformation techniques which attempt to minimize distribution  costs based on the idea of semi-joins and generalized semi-joins in conventional  databases. Although local computation of semi-joins is not possible for the  general case, we indicate classes of programs for which these transformation...
Formaiizing the Repair Process.

Asking About Posibilities %2D Revision and Update Semantics for Subjunctive Queries.

Choosing Observations and Actions in Model%2DBased Diagnosis%2FRepair Systems.

Asking About Possibilities %2D Revision and Update Semantics for Subjunctive Queries.
The AGM rationality postulates for belief revision play an  important role in the formalization of subjunctive queries over knowledge  bases. However, the well known triviality results by Gardenfors in  connection with the Ramsey Test make defining a query semantics corresponding  to these rationality postulates a difficult task. While existing  approaches avoid the triviality results by restricting the postulates in  certain ways, we show that an exact translation into a query semantics  is possible. The resulting semantics allows for the first time the integration  of subjunctive queries evaluated according to a revision semantics  corresponding to the AGM rationality postulates with an update operator  corresponding to the update semantics formalized by Katsuno,  Mendelzon and Grahne. The query semantics extends usual conditional  implication by defining the concepts of possibility and necessity relative  to a knowledge base. Additionally, based on this semantics, we present a  formal account of splitting a knowledge base into two parts. We propose  a specific revision function and show that this function is optimal in the  sense, that after revision as few conditional consequences as possible are  changed.
The P%2DSystems A Systematic Classification of Logics of Nonmonotonicity.
In the last years many logics of nonmonotonicity have been developed  using various different formalisms and axiomatizations which  makes them very difficult to compare. We develop a classification  scheme for these logics using only a few simple concepts and axioms  based on conditional logics, properties of partial pre-orders of possible  worlds and centering assumptions. Our framework (the P-Systems)  allows us to discuss the similarities, main differences and possible extensions  of these logics in a simple and natural way.
Towards a Theory of the Repair Process.

Integrating Model%2DBased Monitoring and Diagnosis of Complex Dynamic Systems.
In this paper we present a new approach to model-based monitoring and diagnosis of dynamic systems. We extend related research work which concentrates either on monitoring (i.e. fault detection) or on diagnosis (i.e. fault localization) and therefore misses important aspects of effective and efficient troubleshooting. The presented DIAMON algorithm) uses hierarchical models to monitor and diagnose dynamic systems. DIAMON is based on the integration of teleological parameter-based monitoring models and repair-oriented device-based diagnosis models. It combines consistency-based diagnosis with model-based monitoring and uses an extension of the QSIM-language for the representation of qualitative system models. Furthermore, DIAMON is able to detect and localize abroad range ofnon-permanent faults and thus extends traditional diagnosis which exclusively deals with permanent faulty behavior. The operation of DIAMON will be demonstrated on a real-world example in a multiple-faults scenario. 1DIAMON means DIAgnosis and MONitoring Algorithm I
Belief Revision%2C Diagnosis and Repair.
this report we have argued that previous work on automated fault diagnosis has focused almost exclusively on diagnosis, and that an integrated approach to FDIR is an essential next step if automated diagnosis is to address the requirements of practical applications such as air and space missions. What is the expected payoff of foundational work in reconfiguration and integrated FDIR such as that described here? We feel that once the focus is expanded from diagnosis
Expert Systems in Engineering

Physical Impossibility Instead of Fault Models.

Redefining the Candidate Space in Model%2DBased Diagnosis.

Hypothesis Classification%2C Abductive Diagnosis and Therapy.
this report we have argued that previous work on automated fault diagnosis has focused almost exclusively on diagnosis, and that an integrated approach to FDIR is an essential next step if automated diagnosis is to address the requirements of practical applications such as air and space missions. What is the expected payoff of foundational work in reconfiguration and integrated FDIR such as that described here? We feel that once the focus is expanded from diagnosis
Revising Domain Theories in Model%2DBased Reasoning Systems.

Integrating logic
This is a description of the system ILF developed at the Humboldt-University at Berlin  1  . ILF is a system that integrates automated theorem provers, proof tactics for interactive deductive systems and models within a graphical user interface. The structure and commands of ILF are presented  2  .  A special part is devoted to the TreeViewer -- a part of ILF used for visualising directed acyclic graphs, which can be used as a separate programme.  We describe the possibilities to extend ILF by integrating more interactive and automated deductive systems.  The last part describes the ProofPad -- a sample configuration for editing proofs in the field of lattice ordered groups.  1  This work was supported by the Deutsche Forschungsgemeinschaft within the project &#034;Deduktion und verbandsgeordnete Gruppen&#034;  2  for further information contact e-mail: gehne@mathematik.hu-berlin.de  Contents  1 What is ILF? 2 2 Installation and Configuration 5 3 The User Interface 9 3.1 The Command Line Interfa...
Using Domain Knowledge to Improve Inductive Learning Algorithms for Diagnosis.

Wissensbasierte Fehlererkennung mit Hilfe eines objektorientierten Modells in ARTEX.

The RQA%2FFQI Strategy Some Thoughts on the Evaluation of Recursive Queries in Knowledge Base Management Systems.

Recursive Strategies for Answering Recursive Queries %2D The RQA%2FFQI Strategy.

ARTEX %2D Wissensbasierte Fehlererkennung und Fehlerbehebung in einem Vermittlungssystem.

